package com.algorithms.datatypes;

import java.util.Collection;
import java.util.ConcurrentModificationException;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.ListIterator;
//import java.util.LinkedList.Link;


public class WeightedLinkedList<E> extends LinkedList<E>{

	transient Link<E> voidLink;

	private static final class Link<ET> {
		ET data;

		Link<ET> previous, next;
        int size;
		Link(ET o, Link<ET> p, Link<ET> n) {
			data = o;
			previous = p;
			next = n;
		}
	}
	/*public void add(ET object) {
		if (expectedModCount == list.modCount) {
			Link<ET> next = link.next;
			Link<ET> newLink = new Link<ET>(object, link, next);
			link.next = newLink;
			next.previous = newLink;
			link = newLink;
			lastLink = null;
			pos++;
			expectedModCount++;
			list.size++;
			list.modCount++;
		} else {
            throw new ConcurrentModificationException();
        }
	}*/

}
